Reduction techniques for the finitistic dimension
نویسندگان
چکیده
In this paper we develop new reduction techniques for testing the finiteness of finitistic dimension a finite dimensional algebra over field. Viewing latter as quotient path algebra, propose two operations on quiver namely arrow removal and vertex removal. The former gives rise to cleft extensions recollements. These provide us practical methods detect algebras dimension. We illustrate our with many examples.
منابع مشابه
Finitistic Dimension through Infinite Projective Dimension
We show that an artin algebra Λ having at most three radical layers of infinite projective dimension has finite finitistic dimension, generalizing the known result for algebras with vanishing radical cube. We also give an equivalence between the finiteness of fin.dim.Λ and the finiteness of a given class of Λ-modules of infinite projective dimension.
متن کاملAn Approach to the Finitistic Dimension Conjecture
Let R be a finite dimensional k-algebra over an algebraically closed field k and modR be the category of all finitely generated left R-modules. For a given full subcategory X of modR, we denote by pfdX the projective finitistic dimension of X . That is, pfdX := sup {pdX : X ∈ X and pdX < ∞}. It was conjectured by H. Bass in the 60’s that the projective finitistic dimension pfd (R) := pfd (modR)...
متن کاملOn finitistic dimension of stratified algebras
In this survey we discuss the results on the finitistic dimension of various stratified algebras. We describe what is already known, present some recent estimates, and list some open problems.
متن کاملEffective Dimension Reduction Techniques for Text Documents
Frequent term based text clustering is a text clustering technique, which uses frequent term set and dramatically decreases the dimensionality of the document vector space, thus especially addressing: very high dimensionality of the data and very large size of the databases. Frequent Term based Clustering algorithm (FTC) has shown significant efficiency comparing to some well known text cluster...
متن کاملDimension Reduction Techniques for Training Polynomial Networks
We propose two novel methods for reducing dimension in training polynomial networks. We consider the class of polynomial networks whose output is the weighted sum of a basis of monomials. Our first method for dimension reduction eliminates redundancy in the training process. Using an implicit matrix structure, we derive iterative methods that converge quickly. A second method for dimension redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2021
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/tran/8409